Rule Modularization and Inference Solutions – a Synthetic Overview

نویسندگان

  • Krzysztof Kaczor
  • Szymon Bobek
  • Grzegorz J. Nalepa
چکیده

Rule–based expert systems proved to be a successful AI technology in a number of areas. Building such systems requires creating a rulebase, as well as providing an effective inference mechanism that fires rules appropriate in a given context. The paper briefly discusses main rule inference algorithms Rete, TREAT and Gator. Since large rulebases often require identifying certain rule clusters, modern inference algorithms support inference rule groups. In the paper the case of the new version of Drools, introducing the RuleFlow module is presented. These solutions are contrasted with a custom rule representation method called XTT2. It introduces explicit structure in the rulebase based on decision tables linked in an inference network. In this case, the classic Rete–based solutions cannot be used. This is why custom inference algorithms are discussed. In the paper possible integration of the XTT2 approach with that of RuleFlow is discussed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Visual Inference Specification Methods for Modularized Rulebases. Overview and Integration Proposal

The paper concerns selected rule modularization techniques. Three visual methods for inference specification for modularized rulebases are described: Drools Flow, BPMN and XTT2. Drools Flow is a popular technology for workflow or process modeling, BPMN is an OMG standard for modeling business processes, and XTT2 is a hierarchical tabular system specification method. Because of some limitations ...

متن کامل

Double Fuzzy Implications-Based Restriction Inference Algorithm

The main condition of the differently implicational inferencealgorithm is reconsidered from a contrary direction, which motivatesa new fuzzy inference strategy, called the double fuzzyimplications-based restriction inference algorithm. New restrictioninference principle is proposed, which improves the principle of thefull implication restriction inference algorithm. Furthermore,focusing on the ...

متن کامل

On a Divide and Conquer Approach for Haplotype Inference with Pure Parsimony

The genotype of an individual consists of two DNA strands, where each strand, called a haplotype, is inherited from each parent. The haplotypes of an individual may differ from those of his/her parents due to mutations or crossovers. Those haplotypes and their differences are the genetic basis for hereditary diseases such as Alzheimer’s, diabetes, and heart diseases. Determining the genotype of...

متن کامل

Inference Processes on Clustered Partial Decision Rules

The aim of the paper is to study efficeient of inference process using clustered partial decision rules. Partial decision rules are constructed by greedy algorithm. They are clustered with Agglomerative Hierarchical Clustering (AHC) algorithm. We study how exact and partial decision rules clustered by AHC algorithm influence on inference process in knowledge base. Clusters of rules are a way of...

متن کامل

Abstract Notions and Inference Systems for Proofs by Mathematical Induction

Notions and Inference Systems for Proofs by Mathematical Induction Claus-Peter Wirth? and Klaus Becker Fb. Informatik, Universität Kaiserslautern, D-67663, Germany {wirth, klbecker}@informatik.uni-kl.de Abstract. Soundness of inference systems for inductive proofs is sometimes Soundness of inference systems for inductive proofs is sometimes shown ad hoc and a posteriori, lacking modularization ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010